{
  The application for Voronoi  Shamos algorithm

  The algorithm according to Shamos-Hoey and Lee that creates the voronoi diagram
  of a 2D point field in N log(N). Copyright (C) 2002 Christian Huettig
  Restrictions: The line-cut algorithm isn't perfect (5% failure, but indicated!)
  Huge problems with collinearity, inefficient line discard algorithm
  How to use: Just throw the main unit and all whats related to out.
  First published: www.torry.net
}

program VoronoiShamosLee;

uses
  Forms,
  GraphObjects in 'GraphObjects.pas',
  VoronoiShamos in 'VoronoiShamos.pas',
  Vor2dPickFm in 'Vor2dPickFm.pas' {FormVor2dPick};

{$R *.res}

begin
  Application.Initialize;
  Application.CreateForm(TFormVor2dPick, FormVor2dPick);
  Application.Run;
end.
